An Axiomatics for Categories of Transition Systems as Coalgebras
نویسندگان
چکیده
We consider a nitely branching transition system as a coalgebra for an endofunctor on the category Set of small sets. A map in that category is a functional bisimulation. So, we study the structure of the category of nitely branching transition systems and functional bisimulations by proving general results about the category H-Coalg of H-coalgebras for an endofunctor H on Set. We give conditions under which H-Coalg is complete, cocomplete, symmetric monoidal closed, regular, and has a subobject classi er.
منابع مشابه
An axiomatics for categories of coalgebras
We give an axiomatic account of what structure on a category C and an endofunctor H on C yield similar structure on the category H Coalg of H-coalgebras. We give conditions under which completeness, cocompleteness, symmetric monoidal closed structure, local presentability, and subobject classi ers lift. Our proof of the latter uses a general result about the existence of a subobject classi er i...
متن کاملOn descent for coalgebras and type transformations
We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...
متن کاملOn tree coalgebras and coalgebra presentations
For deterministic systems, expressed as coalgebras over polynomial functors, every tree t (an element of the final coalgebra) turns out to represent a new coalgebra At. The universal property of these coalgebras, resembling freeness, is that for every state s of every system S there exists a unique coalgebra homomorphism from a unique At which takes the root of t to s. Moreover, the tree coalge...
متن کاملRelational Presheaves as Labelled Transition Systems
We show that viewing labelled transition systems as relational presheaves captures several recently studied examples. This approach takes into account possible algebraic structure on labels. Weak closure of a labelled transition system is characterised as a left (2-)adjoint to a change-of-base functor. A famous application of coalgebra theory [3] is as a pleasingly abstract setting for the theo...
متن کاملRelational Presheaves as Labelled Transition Systems
We show that viewing labelled transition systems as relational presheaves captures several recently studied examples. This approach takes into account possible algebraic structure on labels. Weak closure of a labelled transition system is characterised as a left (2-)adjoint to a change-of-base functor. A famous application of coalgebra [3, 4] is as a pleasingly abstract setting for the theory o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998